منابع مشابه
Recursion in total functionals of finite type
© Foundation Compositio Mathematica, 1977, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http:// http://www.compositio.nl/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier ...
متن کاملRecursion on the partial continuous functionals
We describe a constructive theory of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [28], under the well-known abbreviation LCF. However, the prime example of such a theory, Per Martin-Löf’s type theory [24] in its present form deals with total (structural recursive) functionals only. An early at...
متن کاملDiscrete Integrals and Axiomatically Defined Functionals
Several discrete universal integrals on finite universes are discussed from an axiomatic point of view. We start from the first attempt due to B. Riemann and cover also most recent approaches based on level dependent capacities. Our survey includes, among others, the Choquet and the Sugeno integral and general copula-based integrals.
متن کاملAlgebras defined by homomorphisms
Let $mathcal{R}$ be a commutative ring with identity, let $A$ and $B$ be two $mathcal{R}$-algebras and $varphi:Blongrightarrow A$ be an $mathcal{R}$-additive algebra homomorphism. We introduce a new algebra $Atimes_varphi B$, and give some basic properties of this algebra. Generalized $2$-cocycle derivations on $Atimes_varphi B$ are studied. Accordingly, $Atimes_varphi B$ is considered from th...
متن کاملManaging Complexity by Recursion
Recursion is a well known concept within computer science and mathematics . In business management it is rarely used explicitly. Counterexamples are applications of dynamic programming and the ́Viable System ́ of Stafford Beer [Beer, 1972]. This paper demonstrates the broad applicability of recursion to managing complexity, especially in business. It starts by showing that recursion is – in cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1967
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093956080